Ivor R. H. Kramer, OBE

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

M. Kramer, N. Wex, and R. Wielebinski, eds. Pulsar Electrodynamics

First I emphasize the magnetospheric loop current system induced by the wind activity. Next, I address the formation of the fieldaligned electric field. An interesting aspect is the reaction of the inner magnetosphere to an induced current. In the traditional outer gap, the current running through the gap is all carried by the particles created in the gap. However, if external current-carrying ...

متن کامل

OBE: Outlier by Example

Outlier detection in large datasets is an important problem. There are several recent approaches that employ very reasonable definitions of an outlier. However, a fundamental issue is that the notion of which objects are outliers typically varies between users or, even, datasets. In this paper, we present a novel solution to this problem, by bringing users into the loop. Our OBE (Outlier By Exa...

متن کامل

Ivor, a Proof Engine

Dependent type theory has several practical applications in the fields of theorem proving, program verification and programming language design. Ivor is a Haskell library designed to allow easy extending and embedding of a type theory based theorem prover in a Haskell application. In this paper, I give an overview of the library and show how it can be used to embed theorem proving technology in...

متن کامل

Structural Stefan Kramer

In many real-world domains the task of machine learning algorithms is to learn a theory for predicting numerical values. In particular several standard test domains used in Inductive Logic Programming (ILP) are concerned with predicting numerical values from examples and relational and mostly non-determinate background knowledge. However, so far no ILP algorithm except one can predict numbers a...

متن کامل

H R  C C *

Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. Many distributed computing problems which involve resource sharing can be expressed as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Dental Journal

سال: 2017

ISSN: 0007-0610,1476-5373

DOI: 10.1038/sj.bdj.2017.162